Context

We used to hash data rows, and assign to clusters of data rows an identity equal to the hash of all their children. We're now moving to a more compact representation, where data rows are given an integer key, and we want a unique way of mapping new clusters to new integer keys. This is made more tricky by the fact that we're parallelising the construction of hierarchical clusters.

Changes proposed in this pull request

• Create IntMap data structure taking unordered sets of integers, and mapping them a to a key that 1) is a negative integer; 2) does not collide with other keys generated by other instances of this class, as long as they are initialised with a different salt.
• A few small bug fixes

Guidance to review

The fact that keys are always negative means that it's possible to build a hierarchy where keys are themselves parts of keyed sets, and it's easy to distinguish integers mapped to raw data points (which will be non-negative), to integers that are keys to sets (which will be negative). The salt allows to work with a parallel execution model, where each worker maintains their separate key space, as long as each worker operates on disjoint subsets of positive integers. The salt and a key are combined via the Cantor pairing function.

Checklist:

• My code follows the style guidelines of this project
• New and existing unit tests pass locally with my changes